Complex minimax programming under generalized convexity
نویسندگان
چکیده
منابع مشابه
Duality in nondifferentiable minimax fractional programming with generalized convexity
A Mond–Weir type dual for a class of nondifferentiable minimax fractional programming problem is considered. Appropriate duality results are proved involving (F,a,q,d)-pseudoconvex functions. 2005 Elsevier Inc. All rights reserved.
متن کاملSecond-order duality for nondifferentiable minimax fractional programming problems with generalized convexity
*Correspondence: [email protected] Department of Mathematics, University of Tabuk, Tabuk, Kingdom of Saudi Arabia Abstract In the present paper, we are concerned with second-order duality for nondifferentiable minimax fractional programming under the second-order generalized convexity type assumptions. The weak, strong and converse duality theorems are proved. Results obtained in this paper ext...
متن کاملOn Second-Order Duality for Minimax Fractional Programming Problems with Generalized Convexity
and Applied Analysis 3 K x { ( s, t, ỹ ) ∈ N × R × R : 1 ≤ s ≤ n 1, t t1, t2, . . . , ts ∈ R
متن کاملDuality in Minimax Fractional Programming Problem Involving Nonsmooth Generalized (F,α,ρ,d)-Convexity
In this paper, we discuss nondifferentiable minimax fractional programming problem where the involved functions are locally Lipschitz. Furthermore, weak, strong and strict converse duality theorems are proved in the setting of Mond-Weir type dual under the assumption of generalized (F,α,ρ,d)-convexity.
متن کاملEquilibrium existence under generalized convexity
We introduce, in the first part, the notion of weakly convex pair of correspondences, we give its economic interpretation, we state a fixed point and a selection theorem. Then, by using a tehnique based on a continuous selection, we prove existence theorems of quilibrium for an abstract economy. In the second part, we define the weakly biconvex correspondences, we prove a selection theorem and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2004
ISSN: 0377-0427
DOI: 10.1016/j.cam.2003.09.045